Computer simulation of household activity scheduling
نویسندگان
چکیده
An operational model of household activity scheduling is proposed. The model is based on a theory entailing behavioral principles of how persons acquire, represent, and use information from and about the environment. Choices of destinations and departure times are consequences of the scheduling of a set of activities to be executed in a given time cycle. Illustrative computer simulations of the operational model show realistic effects of work hours, living in or outside the center, and travel speed. Several necessary improvements of the theory and operational model are discussed, such as incorporating learning effects and choice of travel mode for home-based trip chains. Strategies outlined for empirical tests include comparisons with existing models, psychological experiments illuminating basic assumptions, and the use of geographical information systems to process travel-diary data for single cases. Introduction A substantial amount of research has been devoted to the disaggregate modelling of households' travel choices (Pas, 1990). In this research, models of choices of, for instance, travel mode, departure time, and destination have been estimated from travel-diary data It has become increasingly obvious that travel choices should be viewed as the outcome of a process of scheduling activities (Jones et al, 1990; Root and Recker, 1983). At times modelling single independent travel choices may therefore be futile, particularly in view of the impact that changing values, lifestyles , and roles appear to have on travel in contemporary societies (Jones et al, 1983). An important problem is thus how to model dependencies between choices and activities. Some approaches to travel-choice modelling have attempted to take activities into account (see reviews by may also be mentioned in this connection. Furthermore, related research has been carried out with the aim of describing activity patterns, taking into account spatial, temporal, and interpersonal Although many of the approaches followed to date perhaps are useful, they seem to lack a substantive theoretical underpinning. Thus, there is no guarantee that they are descriptive of how people actually make choices. Axhausen (1997) and Garling (1994a) therefore argued for approaches which are more firmly based on behavioral theories,
منابع مشابه
Task Scheduling in Fog Computing: A Survey
Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...
متن کاملData Replication-Based Scheduling in Cloud Computing Environment
Abstract— High-performance computing and vast storage are two key factors required for executing data-intensive applications. In comparison with traditional distributed systems like data grid, cloud computing provides these factors in a more affordable, scalable and elastic platform. Furthermore, accessing data files is critical for performing such applications. Sometimes accessing data becomes...
متن کاملTASA: A New Task Scheduling Algorithm in Cloud Computing
Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...
متن کاملImproving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملAn Optimal Utilization of Cloud Resources using Adaptive Back Propagation Neural Network and Multi-Level Priority Queue Scheduling
With the innovation of cloud computing industry lots of services were provided based on different deployment criteria. Nowadays everyone tries to remain connected and demand maximum utilization of resources with minimum timeand effort. Thus, making it an important challenge in cloud computing for optimum utilization of resources. To overcome this issue, many techniques have been proposed ...
متن کامل